منابع مشابه
Santiago Ramón y Cajal o la pasión España
AUGUSTIN ALBARRACIN, Santiago Ramon y Cajal o la pasion Espaiia, 2nd ed., with introduction by P. Lain Entralgo, Barcelona, Editorial Labor, 1982, 4to, pp. 311, illus., [no price stated], (paperback). Compared with other Continental countries, Spain produced very few outstanding medical scientists in the nineteenth century. It is, therefore, understandable, as well as right and proper, that Spa...
متن کاملEstrada and L-Estrada Indices of Edge-Independent Random Graphs
Let G be a simple graph of order n with eigenvalues λ1, λ2, · · · , λn and normalized Laplacian eigenvalues μ1,μ2, · · · ,μn. The Estrada index and normalized Laplacian Estrada index are defined as EE(G) = ∑n k=1 e λk and LEE(G) = ∑n k=1 e μk−1, respectively. We establish upper and lower bounds to EE and LEE for edge-independent random graphs, containing the classical Erdös-Rényi graphs as spec...
متن کاملBarberos, cirujanos, y gente de mar: la sanidad naval y la profesión quirúrjica en la España ilustrada
Barberos, cirujanos, y gente de mar is a comprehensive examination of naval sanitary policies and their impact on the process of professionalization of the medical practitioners working for the navy during the eighteenth century. It covers the period from the end of the War of Succession to the defeat of the Franco-Spanish fleet at Trafalgar in 1805-the beginning of the decline of Spanish naval...
متن کاملLaplacian Estrada and Normalized Laplacian Estrada Indices of Evolving Graphs
Large-scale time-evolving networks have been generated by many natural and technological applications, posing challenges for computation and modeling. Thus, it is of theoretical and practical significance to probe mathematical tools tailored for evolving networks. In this paper, on top of the dynamic Estrada index, we study the dynamic Laplacian Estrada index and the dynamic normalized Laplacia...
متن کاملLower Bounds for Estrada Index
If G is an (n,m)-graph whose spectrum consists of the numbers λ1, λ2, . . . , λn, then its Estrada index is EE(G) = ∑n i=1 e λi . We establish lower bounds for EE(G) in terms of n and m. Introduction In this paper we are concerned with simple graphs, that have no loops and no multiple or directed edges. Let G be such a graph, and let n and m be the number of its vertices and edges. Then we say ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Literatura Mexicana
سال: 2011
ISSN: 0188-2546
DOI: 10.19130/iifl.litmex.3.1.1992.137